Rosenberg’s Characterization of Maximal Clones
نویسنده
چکیده
We will give a proof of I. G. Rosenberg’s characterization of maximal clones, first published in [11]. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the relations of the list. In Universal Algebra, this translates immediately into a characterization of the finite preprimal algebras: A finite algebra is preprimal if and only if its term operations are exactly the functions preserving a relation of one of the six types listed in the theorem. The difficult part of the proof is to show that all maximal clones or preprimal algebras respectively are of that form. This follows from, and, as we will also demonstrate, is indeed equivalent to, a characterization of primal algebras: We will show that the primal algebras are exactly those whose term operations do not preserve any of the relations on the list.
منابع مشابه
On the (un)decidability of a Near-unanimity Term
We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two fixed elements. On the other hand, based on Rosenberg’s characterization of maximal clones, we present partial results towards proving the decidab...
متن کاملClones on Regular Cardinals
We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a stron...
متن کاملUniqueness of minimal coverings of maximal partial clones
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f . Since this holds if and only if f belongs to no maximal partial clone on Ek, a characterization of partial Sheffer functions reduces to finding families of minimal coverings of maximal partial clones on Ek. We show that for each k ≥ 2 there exists a unique minim...
متن کاملOligomorphic Clones
A permutation group on a countably infinite domain is called oligomorphic if it has finitely many orbits of finitary tuples. We define a clone on a countable domain to be oligomorphic if its set of permutations forms an oligomorphic permutation group. There is a close relationship to ω-categorical structures, i.e., countably infinite structures with a firstorder theory that has only one countab...
متن کاملComposition of Seed Flour of Selected Nigerian Tea (Camellia sinensis) Clones – A Comparative Study
In the present article, six clones of Nigerian Tea (Camellia sinensis) were selected for comparative study. Proximate, phytochemical and functional characterization of the whole Tea seed flour (TSF) was examined. The characteristics of the expressed oil from the seed of the different clones were also carried out. Results shows that oil content ranged between 22.9% (C318) to 28.9% (C228...
متن کامل